JFSolver: A Tool for Modeling and Solving Fuzzy Constraint Satisfaction Problems
نویسندگان
چکیده
The paper presents an experimental toolkit for modeling and solving Cuuy constraint satisfaction problems (FCSPs) called JFSolver. JFSolver is a Java based library developed as an extension of a erisp constraint programming library to provide an enhanced functionality for handling fuzzy constraints including fuzzy constraint specification, propagation and search mechanisms. JFSolver comprises an application programming interface for fuzzy constraint programming and a graphical editor for interactive problem definition and solving. This functionality is demonstrated with an illustrative eumple.
منابع مشابه
A New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملFuzzy Constraint Satisfaction Using CCM — A Local Information Based Computation Model
The present paper proposes a method of solving the fuzzy constraint satisfaction problems defined by Ruttkay. This method is based on CCM, which is a computational model for emergent computation, or for locality-based problem solving. CCM is a type of production system. It works stochastically, or randomly, and works with evaluation functions that are computed only with local information. CCM h...
متن کاملThe Ability of Learning Automata in Solving Constraint Satisfaction Problems
In this paper we have investigated the performance of some stochastic methods for solving constraint satisfaction (CSP) and fuzzy constraint satisfaction problems (FCSP). The purpose of this paper is to study the abilities of learning automaton in solving these problems and comparing it with other stochastic methods. The results confirm those of [2] and show its superiority to other methods.
متن کاملn Solving Fuzzy Constraint Satisfaction Problems with Genetic Algorithms
An attempt to solve fuzzy constraint satisfaction problems (FCSPs) with the use of genetic algorithms (GAS) is presented in the paper. A fuzzy relation that represents the degrees of Satisfaction of fuzzy constraints in a given FCSP is considered as an objective jimction of the respective unconstrained optimization problem. A solution of a FCSP such that all constraints are satisfied to the max...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001